Local antimagic vertex coloring of unicyclic graphs
نویسندگان
چکیده
منابع مشابه
Edge-coloring Vertex-weightings of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...
متن کاملVertex-antimagic total labelings of graphs
In this paper we introduce a new type of graph labeling, the (a, d)vertex-antimagic total labeling, which is a generalization of several other types of labelings. A connected graph G(V, E) is said to be (a, d)-vertex-antimagic total if there exist positive integers a, d and a bijection λ : V ∪ E → {1, 2, . . . , |V | + |E|} such that the induced mapping gλ : V → W is also a bijection, where W =...
متن کاملComputing the vertex separation of unicyclic graphs
We describe an O(n log n) algorithm for the computation of the vertex separation of unicyclic graphs. The algorithm also computes a linear layout with optimal vertex separation in the same time bound. Pathwidth, node search number and vertex separation are different ways of defining the same notion. Path decompositions and search strategies can be derived from linear layouts. The algorithm appl...
متن کاملOn the vertex separation of unicyclic graphs
In the article “Computing the vertex separation of unicyclic graphs”, Information and Computation 192, pp. 123–161, 2004, Ellis et al. proposed an O(n log n) algorithm for computing both the vertex separation and an optimal layout of a unicyclic graph with n vertices. Using the data structures label and label array, we improve the time complexity of their algorithm to O(n).
متن کاملTotal Vertex Irregularity Strength of Certain Classes of Unicyclic Graphs *
A total vertex irregular k-labeling φ of a graph G is a labeling of the vertices and edges of G with labels from the set {1, 2, . . . , k} in such a way that for any two different vertices x and y their weights wt(x) and wt(y) are distinct. Here, the weight of a vertex x in G is the sum of the label of x and the labels of all edges incident with the vertex x. The minimum k for which the graph G...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indonesian Journal of Combinatorics
سال: 2018
ISSN: 2541-2205
DOI: 10.19184/ijc.2018.2.1.4